Busy period analysis of the level dependent PH/PH/1/K queue
نویسندگان
چکیده
منابع مشابه
Busy period analysis of the level dependent PH/PH/1/K queue
In this paper, we study the transient behavior of a level dependent PH/PH/1/K queue during the busy period. We derive in closed-form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. We differentiate between two types of losses: the overflow losses that are due to a full queue and the los...
متن کاملError Analysis of the Mean Busy Period of a Queue
The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.
متن کاملTransient queue length and busy period of the BMAP / PH / 1 queue
We derive in this paper the transient queue length and the busy period distributions in the single server queue with phase-type (PH) services times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precisio...
متن کاملTransient and Busy Period Analysis of the Gi/gi1 Queue as a Hilbert Factorization Problem
In this paper we find the waiting time distribution in the transient domain and the busy period distribution of the GI/G/I queue. We formulate the problem as a two-dimensional Lindley process and then transform it to a Hilbert factorization problem. We achieve the solution of the factorization problem for the GI/R/I, R/G/I queues, where R is the class of distributions with rational Laplace tran...
متن کاملOn the Existence of Moments for the Busy Period in a Single-Server Queue
We obtain sufficient conditions for the finiteness of the moments of the single-server queue busy period in discrete and continuous time. In the cases of power and exponential moments, the conditions found coincide with the known necessary ones. 1. Introduction and notation. Consider a sequence t n n of random vectors with nonnegative coordinates which are i.i.d. in n, but any dependence betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2011
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-011-9213-6